An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy

The redundancy allocation problem (RAP) is one of the most commonly used approaches for improving reliability systems. present study investigates recent variant RAP, namely, RAP with heterogeneous components under mixed strategy. An exact branch-and-price (BP) algorithm proposed that solves in less than CPU second all benchmark instances reported literature. not only first a strategy but also application BP literature optimization problems. capable solving other variants including RAPs either an active or standby strategy, making it possible to investigate advantages over and strategies. Finally, new set generated evaluate performance dealing more challenging instances.